|
In the calculus of variations, a topic in mathematics, the direct method is a general method for constructing a proof of the existence of a minimizer for a given functional,〔Dacorogna, pp. 1–43.〕 introduced by Zaremba and David Hilbert around 1900. The method relies on methods of functional analysis and topology. As well as being used to prove the existence of a solution, direct methods may be used to compute the solution to desired accuracy. == The method == The calculus of variations deals with functionals . The main interest of the subject is to find ''minimizers'' for such functionals, that is, functions such that: The standard tool for obtaining necessary conditions for a function to be a minimizer is the Euler–Lagrange equation. But seeking a minimizer amongst functions satisfying these may lead to false conclusions if the existence of a minimizer is not established beforehand. The functional must be bounded from below to have a minimizer. This means : This condition is not enough to know that a minimizer exists, but it shows the existence of a ''minimizing sequence'', that is, a sequence in such that The direct method may broken into the following steps # Take a minimizing sequence for . # Show that admits some subsequence , that converges to a with respect to a topology on . # Show that is sequentially lower semi-continuous with respect to the topology . To see that this shows the existence of a minimizer, consider the following characterization of sequentially lower-semicontinuous functions. :The function is sequentially lower-semicontinuous if :: for any convergent sequence in . The conclusions follows from :, in other words :. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「direct method in the calculus of variations」の詳細全文を読む スポンサード リンク
|